Low-rank graph optimization for multi-view dimensionality reduction
نویسندگان
چکیده
منابع مشابه
Dimensionality Reduction Based on Low Rank Representation
Dimensionality Reduction is a common way to solve the problem of ‘curse of dimensions’, especially for image processing. Among all these methods, the linear methods are believed to have better performance in actual databases. This paper proposes a novel unsupervised linear dimensionality reduction method that based on low rank representation which aims at finding the subspace structure of the o...
متن کاملTensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions
Machine learning and data mining algorithms are becoming increasingly important in analyzing large volume, multi-relational and multi– modal datasets, which are often conveniently represented as multiway arrays or tensors. It is therefore timely and valuable for the multidisciplinary research community to review tensor decompositions and tensor networks as emerging tools for large-scale data an...
متن کاملGraph optimization for dimensionality reduction with sparsity constraints
Graph-based dimensionality reduction (DR) methods play an increasingly important role in many machine learning and pattern recognition applications. In this paper, we propose a novel graph-based learning scheme to conduct Graph Optimization for Dimensionality Reduction with Sparsity Constraints (GODRSC). Different from most of graph-based DR methods where graphs are generally constructed in adv...
متن کاملHyperspectral Dimensionality Reduction by Tensor Sparse and Low-Rank Graph-Based Discriminant Analysis
Recently, sparse and low-rank graph-based discriminant analysis (SLGDA) has yielded satisfactory results in hyperspectral image (HSI) dimensionality reduction (DR), for which sparsity and low-rankness are simultaneously imposed to capture both local and global structure of hyperspectral data. However, SLGDA fails to exploit the spatial information. To address this problem, a tensor sparse and l...
متن کاملMulti-view low-rank sparse subspace clustering
Most existing approaches address multi-view subspace clustering problem by constructing the affinity matrix on each view separately and afterwards propose how to extend spectral clustering algorithm to handle multi-view data. This paper presents an approach to multi-view subspace clustering that learns a joint subspace representation by constructing affinity matrix shared among all views. Relyi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2019
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0225987